Location Problems with Cutoff

In this paper, we study a generalized version of the Weber problem finding point that minimizes sum its distances to finite number given points. our setting, these may be cut off at value [Formula: see text], and allow for option an empty solution fixed cost text]. We analyze under which circumstances problems can reduced simpler problem, also when definitely have solve more complex with cutoff. furthermore present adaptions algorithm Drezner, Mehrez Wesolowsky (1991 [The facility location limited distances. Transportation Science, 25(3), 183–187, INFORMS]) in certain situations are able substantially reduce computation times as demonstrated simulation study. The sensitivity respect cutoff is studied, allows us provide efficiently solves simultaneously all